Attribute Selection Algorithm with Clustering based Optimization Approach based on Mean and Similarity Distance
نویسندگان
چکیده
With hundreds or thousands of attributes in high-dimensional data, the computational workload is challenging. Attributes that have no meaningful influence on class predictions throughout classification process increase computing load. This article's goal to use attribute selection reduce size which will lessen Considering selected subsets cover all attributes. As a result, there are two stages process: filtering out superfluous information and settling single stand for group similar but otherwise meaningless characteristics. Numerous studies selection, including backward forward been undertaken. experiment accuracy categorization result recommend k-means based PSO clustering-based selection. It likely related present same cluster while irrelevant not identified any clusters. Datasets Credit Approval, Ionosphere, Annealing, Madelon, Isolet, Multiple employed alongside other datasets. Both databases include label each data point. Our test demonstrates using clustering may be done offer subset characteristics doing so produces outcomes more accurate than 80%.
منابع مشابه
A Clustering Approach by SSPCO Optimization Algorithm Based on Chaotic Initial Population
Assigning a set of objects to groups such that objects in one group or cluster are more similar to each other than the other clusters’ objects is the main task of clustering analysis. SSPCO optimization algorithm is anew optimization algorithm that is inspired by the behavior of a type of bird called see-see partridge. One of the things that smart algorithms are applied to solve is the problem ...
متن کاملA Hybrid Data Clustering Approach Based on Cat Swarm Optimization and K- Harmonic Mean Algorithm
Clustering is an important task that is used to find subsets of similar objects from a set of objects such that the objects in the same subsets are more similar than other subsets. Large number of algorithms has been developed to solve the clustering problem. K-Harmonic Mean (KHM) is one of the popular technique that has been applied in clustering as a substitute of K-Means algorithm because it...
متن کاملON FUZZY NEIGHBORHOOD BASED CLUSTERING ALGORITHM WITH LOW COMPLEXITY
The main purpose of this paper is to achieve improvement in thespeed of Fuzzy Joint Points (FJP) algorithm. Since FJP approach is a basisfor fuzzy neighborhood based clustering algorithms such as Noise-Robust FJP(NRFJP) and Fuzzy Neighborhood DBSCAN (FN-DBSCAN), improving FJPalgorithm would an important achievement in terms of these FJP-based meth-ods. Although FJP has many advantages such as r...
متن کاملCommunity detection in sequence similarity networks based on attribute clustering
Networks are powerful tools for the presentation and analysis of interactions in multi-component systems. A commonly studied mesoscopic feature of networks is their community structure, which arises from grouping together similar nodes into one community and dissimilar nodes into separate communities. Here, the community structure of protein sequence similarity networks is determined with a new...
متن کاملA Hybrid Time Series Clustering Method Based on Fuzzy C-Means Algorithm: An Agreement Based Clustering Approach
In recent years, the advancement of information gathering technologies such as GPS and GSM networks have led to huge complex datasets such as time series and trajectories. As a result it is essential to use appropriate methods to analyze the produced large raw datasets. Extracting useful information from large data sets has always been one of the most important challenges in different sciences,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Recent and Innovation Trends in Computing and Communication
سال: 2023
ISSN: ['2321-8169']
DOI: https://doi.org/10.17762/ijritcc.v11i8s.7241